Recent Advances in Exact Optimization of Airline Scheduling Problems
نویسندگان
چکیده
We discuss the formulation and solution of large scale integer optimization problems that arise in the scheduling of transport related services. We rst set the context for these problems within the airline industry by discussing the scheduling process. We then discuss the two key activities of eet assignment and crew scheduling that turn a schedule into an operational plan. We provide current formulations in terms of key objectives and constraints for both the eet and the crew assignment problems. This is followed by a discussion of the state of the art in solution methodology for each problem. We conclude with ideas about promising areas for further work in the application of combinatorial optimization to airline scheduling.
منابع مشابه
Theory and Methodology Airline crew scheduling using Potts mean ®eld techniques
A novel method is presented and explored within the framework of Potts neural networks for solving optimization problems with a non-trivial topology, with the airline crew scheduling problem as a target application. The key ingredient to handle the topological complications is a propagator de®ned in terms of Potts neurons. The approach is tested on arti®cial problems generated with two real-wor...
متن کاملAirline crew scheduling using Potts mean field techniques
A novel method is presented and explored within the framework of Potts neural networks for solving optimization problems with a non-trivial topology, with the airline crew scheduling problem as a target application. The key ingredient to handle the topological complications is a propagator defined in terms of Potts neurons. The approach is tested on artificial problems generated with two real-w...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملRelaxation Heuristics for the Set Covering Problem
The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کامل